Secure Trapdoor Hash Functions Based on Public-Key Cryptosystems

نویسندگان

  • Gary R. Greenfield
  • Sarah Agnes Spence
  • Sarah A. Spence
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EPOC: Efficient Probabilistic Public-Key Encryption (Submission to P1363a)

We describe a novel public-key cryptosystem, EPOC (Efficient Probabilistic Public-Key Encryption), which has two versions: EPOC-1 and EPOC-2. EPOC-1 is a public-key encryption system that uses a one-way trapdoor function and a random function (hash function). EPOC-2 is a public-key encryption system that uses a one-way trapdoor function, two random functions (hash functions) and a symmetric-key...

متن کامل

General Construction of Chameleon All-But-One Trapdoor Functions

Lossy trapdoor functions enable black-box construction of public key encryption (PKE) schemes secure against chosen-ciphertext attack [18]. Recently, a more efficient black-box construction of public key encryption was given in [13] with the help of chameleon all-but-one trapdoor functions (ABO-TDFs). In this paper, we propose a black-box construction for transforming any ABO-TDFs into chameleo...

متن کامل

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new trapdoor mechanism and derive from this technique three encryption schemes: a trapdoor permutation and two homomorphic probabilistic encryption schemes computationally comparable to RSA. Our cryptosystems, based on usual modular...

متن کامل

A Compact Signature Scheme with Ideal Lattice ( Extended

Since the seminal work of Ajtai [1], lattice-based cryptography has attracted many researchers. As fruitful results, there are one-way and collision-resistant hash functions (e.g., [1, 6]) and public-key cryptosystems, which are secure based on the worst-case hardness of lattice problems. However, the primitives have drawbacks; The size of a public key and that of an index of hash functions is ...

متن کامل

Sponge Based CCA2 Secure Asymmetric Encryption for Arbitrary Length Message

OAEP and other similar schemes proven secure in Random-Oracle Model require one or more hash functions with output size larger than those of standard hash functions. In this paper, we show that by utilizing popular Sponge constructions in OAEP framework, we can eliminate the need of such hash functions. We provide a new scheme in OAEP framework based on Sponge construction and call our scheme S...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015